منابع مشابه
Approximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this subgraph closely approximates the maximum weight branching in the original graph. Specifically, it is within a factor of k k+1 . Our interest in finding branchings in this subgraph is motivated by a data compression appl...
متن کاملScaling algorithms for approximate and exact maximum weight matching
The maximum cardinality and maximum weight matching problems can be solved in time Õ(m √ n), a bound that has resisted improvement despite decades of research. (Here m and n are the number of edges and vertices.) In this article we demonstrate that this “m √ n barrier” is extremely fragile, in the following sense. For any > 0, we give an algorithm that computes a (1 − )-approximate maximum weig...
متن کاملFinding an Approximate Maximum
Suppose that there are n elements from a totally ordered domain. The objective is to find, in a minimum possible number of rounds, an element that belongs to the biggest n/2, where in each round one is allowed to ask n binary comparisons. It is shown that log* n +19(1) rounds are both necessary and sufficient in the best algorithm for this problem.
متن کاملApproximate Profile Maximum Likelihood
We propose an efficient algorithm for approximate computation of the profile maximum likelihood (PML), a variant of maximum likelihood maximizing the probability of observing a sufficient statistic rather than the empirical sample. The PML has appealing theoretical properties, but is difficult to compute exactly. Inspired by observations gleaned from exactly solvable cases, we look for an appro...
متن کاملApproximate Maximum Likelihood Sequence Detection
The problem of multiuser detection in asynchronous Direct-Sequence Code-Division Multiple-Access systems with residual errors in timing and amplitude estimation is addressed. Prior work has shown that the maximum-likelihood (ML) solution is sensitive to timing errors as small as a fraction of a chip period. In this paper, residual errors in both synchronization and fading coeecient estimation a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2006
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2006.02.011